Sequential Operations in LogicWeb
نویسندگان
چکیده
Sequential tasks cannot be effectively handled in logic programming based on classical logic or linear logic. This limitation can be addressed by using a fragment of Japaridze’s computability logic. We propose SeqWeb, an extension to LogicWeb with sequential goal formulas. SeqWeb extends the LogicWeb by allowing goals of the form G∧s G and G∨s G where G is a goal. These goals allow us to specify both sequential-conjunctive and sequentialdisjunctive tasks.
منابع مشابه
Secure Prolog Based Mobile Code
LogicWeb mobile code consists of Prolog-like rules embedded in Web pages, thereby adding logic programming behaviour to those pages. Since LogicWeb programs are downloaded from foreign hosts and executed locally, there is a need to protect the client from buggy or malicious code. A security model is crucial for making LogicWeb mobile code safe to execute. This paper presents such a model, which...
متن کاملTowards a Decidable LogicWeb via Length-Bounded Derivations
LogicWeb has traditionally lacked devices for dealing with intractable queries. We address this limitation by adopting length-bounded inference, a form of approximate reasoning. A length-bounded inference is of the form pv(P, G, n) which is a success if a query G can be proved from the web page P within n proof steps. It thus makes LogicWeb decidable and more tractable. During the process, we p...
متن کاملLogicWeb: Enhancing the Web with Logic Programming
LogicWeb is a client-side logic programming tool for the World Wide Web, which allows the Web to be viewed in a more abstract way: Web pages can be rephrased as logic programming modules, and hypertext links as relationships between the modules. This abstraction makes LogicWeb particularly suitable for coding important classes of applications, and this paper considers two in some detail: Web se...
متن کاملMutually Exclusive Rules in LogicWeb
LogicWeb has traditionally lacked devices for expressing mutually exclusive clauses. We address this limitation by adopting choice-conjunctive clauses of the form D0&D1 where D0,D1 are Horn clauses and & is a linear logic connective. Solving a goal G using D0&D1 – pv(D0&D1, G) – has the following operational semantics: choose a successful one between pv(D0, G) and pv(D1, G). In other words, if ...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1412.1221 شماره
صفحات -
تاریخ انتشار 2014